Rank decomposition in zero pattern matrix algebras
نویسندگان
چکیده
منابع مشابه
Decomposition Rank of Z-stable C∗-algebras
We show that C∗-algebras of the form C(X)⊗Z, where X is compact and Hausdorff and Z denotes the Jiang–Su algebra, have decomposition rank at most 2. This amounts to a dimension reduction result for C∗-bundles with sufficiently regular fibres. It establishes an important case of a conjecture on the fine structure of nuclear C∗-algebras of Toms and the second named author, even in a non-simple se...
متن کاملDecomposition rank of subhomogeneous C ∗ -algebras
We analyze the decomposition rank (a notion of covering dimension for nuclear C-algebras introduced by E. Kirchberg and the author) of subhomogeneous C-algebras. In particular we show that a subhomogeneous C-algebra has decomposition rank n if and only if it is recursive subhomogeneous of topological dimension n and that n is determined by the primitive ideal space. As an application, we use re...
متن کاملOn the Classification of Simple Z-stable C-algebras with Real Rank Zero and Finite Decomposition Rank
We show that, if A is a separable simple unital C-algebra which absorbs the Jiang–Su algebra Z tensorially and which has real rank zero and finite decomposition rank, then A is tracially AF in the sense of Lin, without any restriction on the tracial state space. As a consequence, the Elliott conjecture is true for the class of C-algebras as above which, additionally, satisfy the Universal Coeff...
متن کاملZero Triple Product Determined Matrix Algebras
Let A be an algebra over a commutative unital ring C. We say that A is zero triple product determined if for every C-module X and every trilinear map {·, ·, ·}, the following holds: if {x, y, z} 0 whenever xyz 0, then there exists a C-linear operator T : A3 −→ X such that {x, y, z} T xyz for all x, y, z ∈ A. If the ordinary triple product in the aforementioned definition is replaced by Jordan t...
متن کاملRandomized Algorithms for Low-Rank Matrix Decomposition
Low-rank matrix factorization is one of the most useful tools in scientific computing and data analysis. The goal of low-rank factorization is to decompose a matrix into a product of two smaller matrices of lower rank that approximates the original matrix well. Such a decomposition exposes the low-rank structure of the data, requires less storage, and subsequent matrix operations require less c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2016
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-016-0305-7